Feynman graphs and hyperplane arrangements defined over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>

نویسندگان

چکیده

Motivated by some computations of Feynman integrals and certain conjectures on mixed Tate motives, Bejleri Marcolli posed questions about the $\mathbb{F}_1$-structure (in sense torification) complement a hyperplane arrangement, especially for an arrangement defined in space cycles graph. In this paper, we prove that has if only it is Boolean. We also cycle graph Boolean basis consisting such any two them do not share edges.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Koszul algebras from graphs and hyperplane arrangements

This work was started as an attempt to apply theory from noncommutative graded algebra to questions about the holonomy algebra of a hyperplane arrangement. We soon realized that these algebras and their deformations, which form a class of quadratic graded algebras, have not been studied much and yet are interesting to algebra, arrangement theory and combinatorics. Let X be a topological space h...

متن کامل

Relation Spaces of Hyperplane Arrangements and Modules Defined by Graphs of Fiber Zonotopes

We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we consider the corresponding relation complexes and give a simple proof of the n-formality of these hyperplane arrangements. As an application, we are able to bou...

متن کامل

Random Walk and Hyperplane Arrangements

Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...

متن کامل

Invariant factors of graphs associated with hyperplane arrangements

A matrix called Varchenko matrix associated with a hyperplane arrangement was defined by Varchenko in 1991. Matrices that we shall call q-matrices are induced from Varchenko matrices. Many researchers are interested in the invariant factors of these q-matrices. In this paper, we associate this problem with a graph theoretic model. We will discuss some general properties and give some methods fo...

متن کامل

Branched Polymers and Hyperplane Arrangements

We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie [BI], and Kenyon and Winkler [KW] to any hyperplane arrangement A. The volume of the resulting configuration space of connected branched polymers associated to the hyperplane arrangement A is expressed through the value of the chara...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geometry and Physics

سال: 2021

ISSN: ['1879-1662', '0393-0440']

DOI: https://doi.org/10.1016/j.geomphys.2021.104368